A Formulation of TLA in Isabelle
نویسنده
چکیده
The Temporal Logic of Actions is a formalism for reasoning about concurrent and reactive systems. In this paper I present a formulation of TLA in the Isabelle theorem prover, in which I make extensive use of facilities in the Isabelle system for embedding diierent logics, particularly the syntax for easy axiomatisation of logics and the existence of parsing and printing facilities. I show how these aspects of Isabelle have facilitated the embedding, and describe an example proof done within the implementation.
منابع مشابه
A Definitional Encoding of TLA* in Isabelle/HOL
We mechanise the logic TLA∗ [8], an extension of Lamport’s Temporal Logic of Actions (TLA) [5] for specifying and reasoning about concurrent and reactive systems. Aiming at a framework for mechanising the verification of TLA (or TLA∗) specifications, this contribution reuses some elements from a previous axiomatic encoding of TLA in Isabelle/HOL by the second author [7], which has been part of ...
متن کاملA TLA+ Proof System
We describe an extension to the TLA specification language with constructs for writing proofs and a proof environment, called the Proof Manager (PM), to checks those proofs. The language and the PM support the incremental development and checking of hierarchically structured proofs. The PM translates a proof into a set of independent proof obligations and calls upon a collection of back-end pro...
متن کاملTowards certification of TLA+ proof obligations with SMT solvers
TLA+ is a formal specification language that is based on Zermelo-Fränkel set theory and the Temporal Logic of Actions TLA. The TLA+ proof system TLAPS assists users in deductively verifying safety properties of TLA+ specifications. TLAPS is built around a proof manager, which interprets the TLA+ proof language, generates corresponding proof obligations, and passes them to backend verifiers. In ...
متن کاملAn Encoding of TLA in Isabelle
This note describes the representation of Lamport's Temporal Logic of Actions that comes with the standard distribution of the generic theorem prover Isabelle. It is based on a simple technique for embedding possible-worlds based logics in Isabelle. 1 Background Formal methods will only be applied in practice if they are supported by suuciently powerful, highly automated, and extensible proof t...
متن کاملFrom a Specification to an Equivalence Proof in Object-Oriented Parallelism
We investigate the use of a TLA speci cation for modeling and proving parallelization within an object-oriented language. Our model is based on Ei el= a parallel extension of Ei el, where sequential programs can be reused for parallel or concurrent programming with very minor changes. We want to prove that both versions of a given program (sequential and parallel) are equivalent with respect to...
متن کامل